package cn.michael.dev.leetcode;

/**
 * Created by hufenggang on 2021/8/11.
 *
 * 问题描述：
 * 爬楼梯问题
 */
public class Problem70 {

    public int climbStairs(int n) {
        int[] dp = new int[n + 1];
        dp[0] = 1;
        dp[1] = 2;
        for (int i = 2; i < n; i++) {
            dp[i] = dp[i - 1] + dp[i -2];
        }

        return dp[n - 1];
    }
}
